Classical Logic of Bunched Implications
نویسندگان
چکیده
We consider a classical (propositional) version, CBI, of O’Hearn and Pym’s logic of bunched implications (BI) from a modeland prooftheoretic perspective. We present a class of classical models of BI which extend the usual BI-models, based on partial commutative monoids, with an algebraic notion of “resource negation”. This class of models gives rise to natural definitions of multiplicative falsity, negation and disjunction. We demonstrate that a sequent calculus proof system for CBI is sound with respect to our classical models by translating CBI sequent proofs into proofs in BI, a sound extension of sequent calculus for BI.
منابع مشابه
Classical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O’Hearn and Pym’s logic of bunched implications BI. CBI differs from existing bunched logics in that its multiplicative connectives behave classically rather than intuitionistically (including in particular a multiplicative version of classical negation). At the semantic level, CBI-formulas have th...
متن کاملPetri Net Semantics of Bunched Implications
Engberg and Winskel's Petri net semantics of linear logic is reconsidered , from the point of view of the logic BI of bunched implications. We rst show how BI can be used to overcome a number of diiculties pointed out by Engberg and Winskel, and we argue that it provides a more natural logic for the net semantics. We then brieey consider a more expressive logic based on an extension of BI with ...
متن کاملOn Model Checking Boolean BI
The logic of bunched implications (BI), introduced by O’Hearn and Pym, is a substructural logic which freely combines additive and multiplicative implications. Boolean BI (BBI) denotes BI with classical interpretation of additives and its model is the commutative monoid. We show that when the monoid is finitely generated and propositions are recursively defined, or the monoid is infinitely gene...
متن کاملStone-Type Dualities for Separation Logics
Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because — in addition to elegant abstraction — they strengthen soundness and completeness to a categorical equivalence, yielding a framework through which both algebraic and topological methods can be brought to bear on a logic. We give a systematic treatment of Stone-type duality...
متن کاملLogic Programming with Bunched Implications (extended Abstract)
We introduce the logic of bunched implications, BI, in which multiplicative (or linear) and additive (or intuitionistic) implications live side-by-side. We provide a truth conditional semantics, a proof theory and a categorical semantics of proofs. We explain how BI arises as a logic of resources and sketch a development of this computational interpretation, which is quite diierent from that of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008